Floor Scale Modulo Lifting for QC-LDPC codes

نویسندگان

  • Nikita Polyanskii
  • V. S. Usatyuk
  • Ilya Vorobyev
چکیده

In the given paper we present a novel approach for constructing a QC-LDPC code of smaller length by lifting a given QC-LDPC code. The proposed method can be considered as a generalization of floor lifting. Also we prove several probabilistic statements concerning a theoretical improvement of the method with respect to the number of small cycles. Making some offline calculation of scale parameter it is possible to construct a sequence of QC-LDPC codes with different circulant sizes generated from a single exponent matrix using only floor and scale operations. The only parameter we store in memory is a constant needed for scaling.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower bounds on the lifting degree of single-edge and multiple-edge QC-LDPC codes by difference matrices

In this paper, we define two matrices named as “difference matrices”, denoted by D and DD which significantly contribute to achieve regular single-edge QC-LDPC codes with the shortest length and the certain girth as well as regular and irregular multiple-edge QC-LDPC codes. Making use of these matrices, we obtain necessary and sufficient conditions to have single-edge (m,n)-regular QC-LDPC code...

متن کامل

Efficient Search of QC-LDPC Codes with Girths 6 and 8 and Free of Elementary Trapping Sets with Small Size

One of the phenomena that influences significantly the performance of low-density parity-check codes is known as trapping sets. An (a, b) elementary trapping set, or simply an ETS where a is the size and b is the number of degree-one check nodes and b a < 1, causes high decoding failure rate and exert a strong influence on the error floor. In this paper, we provide sufficient conditions for exp...

متن کامل

On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles

Random bipartite graphs, random lifts of bipartite protographs, and random cyclic lifts of bipartite protographs are used to represent random low-density parity-check (LDPC) codes, randomly constructed protograph-based LDPC codes, and random quasi-cyclic (QC) LDPC codes, respectively. In this paper, we study the distribution of cycles of different length in all these three categories of graphs....

متن کامل

A method of constructing the half-rate QC-LDPC codes with linear encoder, maximum column weight three and inevitable girth 26

This paper presents a method of constructing the half-rate irregular quasi-cyclic low-density parity-check codes which can provide linear encoding algorithm and their H-matrices may contain almost the least “1” elements comparing with H-matrices of all existing LDPC codes. This method shows that three kinds of special structural matrices, respectively named as S-matrix, M-matrix and A-matrix, a...

متن کامل

On Advisability of Designing Short Length QC-LDPC Codes Using Perfect Difference Families

A simple and general definition of quasi cyclic low-density parity-check (QC-LDPC) codes which are constructed based on circulant permutation matrices (CPM) is proposed. As an special case of this definition, we first represent one type of so called combinatorially designed multiple-edge protograph codes. The code construction is mainly based on perfect difference families (PDF’s) and is called...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1701.07521  شماره 

صفحات  -

تاریخ انتشار 2017